Recursion theory on the reals and continuous-time computation
نویسندگان
چکیده
منابع مشابه
Recursion Theory on the Reals and Continuous-Time Computation
We de ne a class of recursive functions on the reals analogous to the classical recursive functions on the natural numbers corresponding to a conceptual analog computer that operates in continuous time This class turns out to be surprisingly large and includes many functions which are uncomputable in the traditional sense We stratify this class of functions into a hierarchy according to the num...
متن کاملCOntinuous tiMe comPUTations. Computations on the Reals.
We propose to contribute to understand computation theories for continuous time systems. This is motivated by • understanding algorithmic complexity of automatic verification procedures for continuous and hybrid systems; • understanding some new models of computations. New models of computations under study include analog electronics models, and some recent sensor and telecommunication networks...
متن کاملA Recursion-theoretic Characterization of Constructible Reals
Let Ly denote Godel's constructive universe up to level y. A countable ordinal y is said to be an index if Ly+1 contains a real not in L r The notion was introduced by Boolos and Putnam [1] who also initiated the study (from the recursion-theoretic viewpoint) of what is known today as " the fine structure of L". In the set-theoretic context, Jensen [3] later extended their results to all levels...
متن کاملthe effects of time planning and task complexity on accuracy of narrative task performance
هدف اصلی این تحقیق بررسی تاثیر برنامه ریزی زمانی، هم چنین افزایش میزان پیچیدگی تکالیف در نظر گرفته شده بصورت همزمان، بر دقت و صحت و پیچیدگی عملکرد نوشتاری زبان آموزان می باشد. بدین منظور، 50 نفر از دانش آموزان دختر در رده ی سنی 16 الی 18 سال به عنوان شرکت کنندگان در این زمینه ی تحقیق در نظر گرفته شدند و به دو گروه آزمایشی و کنترل بصورت اتفاقی تقسیم شدند. اعضای گروه آزمایشی هر دو تکلیف ساده و پی...
Recursion on the partial continuous functionals
We describe a constructive theory of computable functionals, based on the partial continuous functionals as their intendend domain. Such a task had long ago been started by Dana Scott [28], under the well-known abbreviation LCF. However, the prime example of such a theory, Per Martin-Löf’s type theory [24] in its present form deals with total (structural recursive) functionals only. An early at...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1996
ISSN: 0304-3975
DOI: 10.1016/0304-3975(95)00248-0